BoolVar/PB v1.0, a java library for translating pseudo-Boolean constraints into CNF formulae
نویسنده
چکیده
BoolVar/pb v1.0 is an open source java library dedicated to the translation of pseudo-Boolean constraints into cnf formulae. Input constraints can be categorized with tags. Several encoding schemes are implemented in a way that each input constraint can be translated using one or several encoders, according to the related tags. The library can be easily extended by adding new encoders and / or new output formats. It is available at http://boolvar.sourceforge.net/.
منابع مشابه
PBLib - A Library for Encoding Pseudo-Boolean Constraints into CNF
PBLib is an easy-to-use and efficient library, written in C++, for translating pseudo-Boolean (PB) constraints into CNF. We have implemented fifteen different encodings of PB constraints. Our aim is to use efficient encodings, in terms of formula size and whether unit propagation maintains generalized arc consistency. Moreover, PBLib normalizes PB constraints and automatically uses a suitable e...
متن کاملA Family of Encodings for Translating Pseudo-Boolean Constraints into SAT
A Pseudo-Boolean constraint, PB-constraint, is a linear constraint over Boolean variables. This kind of constraints has been widely used in expressing NP-complete problems. This paper introduces a family of algorithms for translating PseudoBoolean constraints into CNF clauses. These algorithms are centered around the idea of rewriting a PB-constraint as the conjunction of a set of easier to tra...
متن کاملNew Encoding for Translating Pseudo-Boolean Constraints into SAT
A Pseudo-Boolean (PB) constraint is a linear arithmetic constraint over Boolean variables. PB constraints are and widely used in declarative languages for expressing NP-hard search problems. While there are solvers for sets of PB constraints, there are also reasons to be interested in transforming these to propositional CNF formulas, and a number of methods for doing this have been reported. We...
متن کاملTranslating Pseudo-Boolean Constraints into CNF
A Pseudo-Boolean constraint is a linear constraint over Boolean variables. This kind of constraints has been widely used in expressing NP-complete problems. This paper introduces a new algorithm for translating Pseudo-Boolean constraints into CNF clauses. The CNF produced by the proposed encoding has small size, and we also characterize the constraints for which one can expect the SAT solvers t...
متن کاملPueblo: A Hybrid Pseudo-Boolean SAT Solver
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization problems. To achieve this, we adopt the cutting-plane technique to draw inferences among PB constraints and combine it with generic implication graph analysis for conflictinduced learning. Novel features of our approa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1103.3954 شماره
صفحات -
تاریخ انتشار 2011